import Sort.MySort;

import java.util.Arrays;

public class findMistake {
    public static void main(String[] args) {
        int[] array = new int[10000];
        findError(array);

    }
    private static void findError(int[] array) {
        //heap 建立大根堆有错
        text.unOrder(array);//错误是因为并没有吧根节点进行向下调整
        System.out.println(Arrays.toString(array));
        MySort.heapSort(array);
        System.out.println(Arrays.toString(array));

//        int[] array1 = Arrays.copyOf(array, array.length);
//        System.out.println(Arrays.toString(array));
//        System.out.println(Arrays.toString(array1));
//
////        Sort.MySort.countSort(array,0,array.length);
//        Sort.MySort.quickSort(array1);
//        System.out.println(Arrays.toString(array1));
//        Sort.MySort.heapSort(array);
//        System.out.println(Arrays.toString(array));
//        System.out.println(Arrays.compare(array, array1));

    }
}
